Definition

A strategy vector σ=(σ1,σ2,...,σn)\sigma^* = (\sigma_1^*,\sigma_2^*,...,\sigma_n^*) is a Bayesian equilibrium if for each player iNi \in N, each type tiTit_i \in T_i, and each possible action aiAi(ti)a_i \in A_i(t_i),

Ui(σ|ti)Ui((ai,σi)|ti)U_i(\sigma^* \vert t_i) \geq U_i ((a_i, \sigma_{-i}^*) \vert t_i)

An equivalent way to define Bayesian equilibrium is via an auxiliary game, the agent-form game.

Theorem (Bayesian equilibrium and Nash equilibrium in corresponding agent-form game)

A strategy vector σ=(σi)iN\sigma^* = (\sigma_i^*)_{i \in N} is a Bayesian equilibrium in a game Γ\Gamma with incomplete information if and only if the strategy vector (σi(ti))iN,tiTi(\sigma_i^*(t_i))_{i \in N, t_i \in T_i} is a Nash equilibrium in the corresponding agent-form game Γˆ\hat{\Gamma}.

Theorem (incomplete information and finite set of actions)

Every game with incomplete information in which the set of types is finite and the set of actions of each type is finite has a Bayesian equilibrium (in behavior strategies).

Theorem (Harsanyi, 1967)

In a game with incomplete information in which the number of types of each player is finite, every Bayesian equilibrium is also a Nash equilibrium, and conversely every Nash equilibrium is also a Bayesian equilibrium.


References

  1. M. Maschler, E. Solan, and Shmuel Zamir, Game Theory, Cambridge University Press, 2013, p. 354.